A cμ rule for parallel servers with two-tiered cμ preferences
نویسنده
چکیده
The cμ rule is known to be optimal in many queueing systems with memoryless service times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server and the second tier contains a class that can be served by all servers. The cμ preferences give priority to the first tier. Sequencing decisions are made to minimize linear holding costs. The proofs employ stochastic coupling sample path arguments.
منابع مشابه
A ℂµ Rule for Two-Tiered Parallel Servers
The cμ rule is known to be optimal in many queueing systems with memoryless service and inter-arrival times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server each, and the second tier contains a class that can be served by all servers. The cμ...
متن کاملOn Learning the cμ Rule: Single and Multiserver Settings
We consider learning-based variants of the cμ rule – a classic and well-studied scheduling policy – in single and multi-server settings for multi-class queueing systems. In the single server setting, the cμ rule is known to minimize the expected holdingcost (weighted queue-lengths summed both over classes and time). We focus on the setting where the service rates μ are unknown, and are interest...
متن کاملSolving convex optimization with side constraints in a multi-class queue by adaptive cμ rule
We study convex optimization problems with side constraints in a multiclass M/G/1 queue with controllable service rates. In the simplest problem of optimizing linear costs with fixed service rate, the cμ rule is known to be optimal. A natural question to ask is whether such simple policies exist for more complex control objectives. In this paper, combining the achievable region approach in queu...
متن کاملOptimal control of a multiclass queueing system when customers can change types
It is well known that the cμ-rule is optimal for serving multiple types of customers to minimize the expected total waiting cost. What happens when less valuable customers (thosewith lower cμ) can change to valuable ones? In this paper,we study this problem by considering two types of customers. The first type of customers is less valuable, but it may change to the second type (i.e., more valua...
متن کاملOn the Converse to a Theorem of Atiyah and Bott
Throughout this paper, C denotes a smooth projective curve of genus at least one, G denotes a reductive linear algebraic group over C, and ξ0 is a C ∞ principal G-bundle over C. The space of all (0, 1)-connections on ξ0 is an affine space A = A(ξ0) associated to the infinite dimensional complex vector space H0,1(C; ad ξ0). Following Shatz [6] for the case G = GL(n), Atiyah and Bott [1] defined ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010